Performance Veri cation Using PDLand Constraint Satisfaction 1
نویسندگان
چکیده
The performance description language PDL provides a compact notation for the speciication of non-functional attributes of VLSI systems. This paper presents evaluation mechanisms which allow the designer to assert performance goals on PDL models of VLSI systems and determine if the constrained models are satissable. This is done by developing a PDL performance model and constructing a constraint satisfaction problem from the system of dependencies. This allows the designer to verify that an implementation of a VLSI system can satisfy all performance goals.
منابع مشابه
Constraint-Based Timetabling-A Case Study
This paper reports a case study in applying Constraint-Satisfaction techniques to university and school timetabling. It involves the construction of a substantial, carefully speci ed, fully tested and fully operational system. The software engineering aspect of Constraint-Satisfaction is emphasized in this paper. Constraint-Satisfaction problems are expressed in a language more familiar to the ...
متن کاملToward a Provably Correct Implementation of the JVM Bytecode Veri er
This paper reports on our ongoing e orts to realize a provably correct implementation of the Java Virtual Machine bytecode veri er We take the perspective that bytecode veri cation is a data ow analysis problem or more generally a constraint solving prob lem on lattices We employ Specware a system available from Kestrel Institute that supports the development of programs from speci cations to f...
متن کاملTowards computational veri cation of Self-organising Logic of Structures
Self-organising Logic of Structures (SLS), a semantic representation language of high expressive power, seems attractive from a theoretical point of view. To check its usefulness for natural language understanding systems, an implementation is required. This article presents our e orts aimed at computational veri cation of SLS. We discuss some computational problems and propose a solution based...
متن کاملSatis ability Modulo Structures as Constraint Satisfaction: An Introduction
Constraint Programming (CP) and Satis ability Modulo Theories (SMT) both generalize SAT w.r.t. expressiveness and propagation power. CP uses domain propagators based on mathematical structures, whereas SMT uses constraint propagators based on logical theories. In this paper, we incorporate SMT reasoning into CP and illustrate the bene ts of the resulting system for the problem of rule veri cation.
متن کاملUPPAAL: Status & Developments
Uppaal is a tool box for validation (via graphical simulation) and veri cation (via automatic model-checking) of real-time systems, based on constraint solving and onthey techniques. It consists of three main parts: a description language, a simulator and a model-checker. It is appropriate for systems that can be modelled as networks of timed automata [3, 2], i.e. a collection of non-determinis...
متن کامل